PENERAPAN TEORI GRAF UNTUK MENYELESAIKAN MASALAH MINIMUM SPANNING TREE (MST) MENGGUNAKAN ALGORITMA KRUSKAL
نویسندگان
چکیده
منابع مشابه
The Filter-Kruskal Minimum Spanning Tree Algorithm
We present Filter-Kruskal – a simple modification of Kruskal’s algorithm that avoids sorting edges that are “obviously” not in the MST. For arbitrary graphs with random edge weights, Filter-Kruskal runs in time O ( m + n log n log m n ) , i.e. in linear time for not too sparse graphs. Experiments indicate that the algorithm has very good practical performance over the entire range of edge densi...
متن کامل4 Minimum Spanning Tree
This first algorithm is quite simple. (Though this was probably known earlier, its proof can be found in Prof. Indyk’s 1999 paper “Sublinear Time Algorithms for Metric Space Problems”.) Let Dij denote the distance between a pair of points i and j, over m total points. The entries of Dij must satisfy the triangle inequality; additionally the matrix is symmetric. Note that the matrix size (i.e., ...
متن کاملA Kruskal-Based Heuristic for the Rooted Delay-Constrained Minimum Spanning Tree Problem
The rooted delay-constrained minimum spanning tree problem is an NP-hard combinatorial optimization problem arising for example in the design of centralized broadcasting networks where quality of service constraints are of concern. We present a construction heuristic based on Kruskal’s algorithm for finding a minimum cost spanning tree which eliminates some drawbacks of existing heuristic metho...
متن کاملComputing Geometric Minimum Spanning Trees Using the Filter-Kruskal Method
Let P be a set of points in R. We propose GeoFilterKruskal, an algorithm that computes the minimum spanning tree of P using well separated pair decomposition in combination with a simple modification of Kruskal’s algorithm. When P is sampled from uniform random distribution, we show that our algorithm runs in O(n log n) time with probability at least 1−1/n for a given c > 1. Although this is th...
متن کاملAn Efficient Distance-Energy-based Minimum Spanning Tree (DE-MST) for Wireless Sensor Networks
The sensor nodes used in Wireless Sensor Networks (WSN) perform close-range sensing in any environment and are compact, battery-powered, light-weight devices. The overall network performance depends on the routing protocols in the network layer and the flow control protocols at the data link layer. This study proposes a novel routing protocol by adapting the Minimum Spanning Tree (MST), Low-Ene...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: AKSIOMA Journal of Mathematics Education
سال: 2012
ISSN: 2442-5419,2089-8703
DOI: 10.24127/ajpm.v1i2.68